Optimal Multistage Switching Networks

Optimal Multistage Switching Networks

from that of Gaussian. It may be noted that this characteristic of pseudo-error detectors was predicted by G ~ o d i n g (~) and may now be regarded as being confirmed.' Scrutiny of Figures 8, 9 and 10 indicates that the achieved stability of the multiplication factor is sufficient to estimate BER from the pseudo-error rate with an accuracy of about a factor of 10 in BER. In addition, the estim...

Performance Study of Packet Switching Multistage Interconnection Networks

Optimal Constructions of Fault - Tolerant Multistage Interconnection Networks

In this paper we discover the family of Fault-Tolerant Multistage Interconnection Networks (MINs) that tolerates switch faults with a minimal number of redundant switching stages. While previously known constructions handled switch faults by eliminating complete stages, our approach is to bypass faulty switches by utilizing redundant paths. As a result, we are able to construct the rst known fa...

Optimal MAC State Switching for cdma2000 Networks

This paper deals with the performance modeling of the various MAC states as defined by the cdma2000 protocol. Our method uses a composite performance metric which has the capability of proportionally combining three basic parameters: channel utilization, waiting time and the saving in the signalling overhead. The scheduler at the base station is not only responsible for admitting new services i...

Optimal Multipass Self-Routing Algorithms for Packet-Switched Multistage Networks

The Clos(m, n) network [1] is a three-stage rearrangeable network capable ofrouting any permutation on N = mn elements. It was proven recently that the three-stage Clos(m, n) network is not self-routing except when the first (and the last) stage contains only two ( ~ x ~)-switches [3]. However, such a network contains O(N2 ) elementary switches which is close to that of a full crossbar network....